class MyCircularQueue {

    public int[] elem;
    public int front;//队头
    public int rear;//队尾(可以存放数据的下标，使用前没有数据为null）


    public MyCircularQueue(int k) {
        elem=new int[k+1];
    }

    public boolean enQueue(int value) {
        if (isFull()) {
            return false;
        }else {
            elem[rear]=value;
            rear=(rear+1)%elem.length;
            return true;
        }
    }

    //出队
    public boolean deQueue() {
        if (isEmpty()) {
            return false;
        }
        front=(front+1)%elem.length;
        return true;
    }

    public int Front() {
        if (isEmpty()) {
            return -1;
        }
        return elem[front];
    }

    public int Rear() {
        if (isEmpty()) {
            return -1;
        }
        int index=rear==0?elem.length-1:rear-1;
        return elem[index];
    }

    public boolean isEmpty() {
        return rear==front;
    }

    public boolean isFull() {
        return (rear+1)%elem.length==front;
    }
}

